Techniques for case allocation

ABSTRACT

Techniques for case allocation are disclosed. In one particular embodiment, the techniques may be realized as a method for case allocation comprising receiving, by at least one computer processor, at least one case allocation allocated using a first pairing strategy, and then reassigning, by the at least one computer processor, the at least one case allocation using behavioral pairing.

CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is a continuation patent application of U.S. patent application Ser. No. 16/194,598, filed Nov. 19, 2018 (now U.S. Pat. No. 10,708,432), which is a continuation patent application of U.S. patent application Ser. No. 15/892,166 filed Feb. 8, 2018 (now U.S. Pat. No. 10,135,988), which is a continuation of U.S. patent application Ser. No. 15/364,699, filed Nov. 30, 2016 (now U.S. Pat. No. 9,924,041), which claims priority to U.S. Provisional Patent Application No. 62/261,780, filed Dec. 1, 2015, each of which is hereby incorporated by reference in its entirety as if fully set forth herein.

FIELD OF THE DISCLOSURE

This disclosure generally relates to customer service/contact center case assignment, more particularly, to techniques for collaborative and non-collaborative allocations of cases to agents using behavioral pairing.

BACKGROUND OF THE DISCLOSURE

In some customer service centers, cases may be assigned to agents (e.g., analysts, specialists) for servicing. For example, insurance claims may be assigned to insurance adjusters or other agents for subrogation or other processing; patients or other insureds may be assigned to nurses, pharmacists, or other clinical support specialists; debt collectors may be assigned to debtor cases; and so on. These cases may be assigned in a variety of ways. In some customer service centers (including, for example, workflow, case management, or transaction processing service or support organizations), cases may be assigned to agents based on time of arrival. This strategy may be referred to as a “first-in, first-out”, “FIFO”, or “round-robin” strategy. In some customer service centers, management (e.g., managers or supervisors) may assign cases to agents (including other types of specialists such as those mentioned above), possibly with a particular rationale based on information known to the management, such as information about an agent's skills or historical performance. For some cases, management may have low confidence in their assignments or lack relevant information to make optimal assignments.

Also, in some customer contact centers, cases or contacts may be assigned to agents for servicing. For example, a “lead list” of contacts may be generated for each agent to contact (e.g., using an outbound dialer). These contacts may be assigned to agents using a FIFO strategy. In other environments, contacts may be assigned to agents using other methods such as management-based assignments.

In view of the foregoing, it may be understood that there may be significant problems and shortcomings associated with current FIFO or management-assigned strategies.

SUMMARY OF THE DISCLOSURE

Techniques for case allocation are disclosed. In one particular embodiment, the techniques may be realized as a method for case allocation comprising receiving, by at least one computer processor, at least one case allocation allocated using a first pairing strategy, and then reassigning, by the at least one computer processor, the at least one case allocation using behavioral pairing.

In accordance with other aspects of this particular embodiment, the first pairing strategy is assigned by management.

In accordance with other aspects of this particular embodiment, the first pairing strategy is a first-in, first-out (FIFO) pairing strategy.

In accordance with other aspects of this particular embodiment, a subsequent reassignment of the at least one case allocation using the first pairing strategy may be received by the at least one computer processor.

In accordance with other aspects of this particular embodiment, a subsequent reversion of the at least one case allocation using the first pairing strategy may be received by the at least one computer processor.

In accordance with other aspects of this particular embodiment, a plurality of case allocations allocated using the first pairing strategy is received by the at least one computer processor, the plurality of case allocations may be split by the at least one computer processor into at least a first portion of cases and a second portion of cases, and the second portion of case allocations may be reassigned by the at least one computer processor using behavioral pairing without reassigning the first portion of case allocations.

In accordance with other aspects of this particular embodiment, a difference in performance between the first portion of case allocations and the second portion of case allocations may be determined by the at least one computer processor.

In accordance with other aspects of this particular embodiment, splitting the plurality of cases is based in part on at least one rationale from management for at least one of the plurality of case allocations.

In accordance with other aspects of this particular embodiment, splitting the plurality of cases is based in part on at least one confidence level from management for at least one of the plurality of case allocations.

In another particular embodiment, the techniques may be realized as a system for case allocation comprising at least one computer processor configured to receive at least one case allocation allocated using a first pairing strategy, and then reassign the at least one case allocation using behavioral pairing. The system may also comprise at least one memory, coupled to the at least one computer processor, configured to provide the at least one computer processor with instructions.

In another particular embodiment, the techniques may be realized as an article of manufacture for case allocation comprising at least one non-transitory computer processor readable medium and instructions stored on the at least one medium, wherein the instructions are configured to be readable from the at least one medium by at least one computer processor and thereby cause the at least one computer processor to operate so as to receive at least one case allocation allocated using a first pairing strategy and then reassign the at least one case allocation using behavioral pairing.

The present disclosure will now be described in more detail with reference to particular embodiments thereof as shown in the accompanying drawings. While the present disclosure is described below with reference to particular embodiments, it should be understood that the present disclosure is not limited thereto. Those of ordinary skill in the art having access to the teachings herein will recognize additional implementations, modifications, and embodiments, as well as other fields of use, which are within the scope of the present disclosure as described herein, and with respect to which the present disclosure may be of significant utility.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to facilitate a fuller understanding of the present disclosure, reference is now made to the accompanying drawings, in which like elements are referenced with like numerals. These drawings should not be construed as limiting the present disclosure, but are intended to be illustrative only.

FIG. 1 shows a flow diagram of a collaborative allocation system according to embodiments of the present disclosure.

FIG. 2 shows a flow diagram of a collaborative allocation method according to embodiments of the present disclosure.

FIG. 3 shows a schematic representation of case splits according to embodiments of the present disclosure.

FIG. 4 shows a flow diagram of a non-collaborative allocation system according to embodiments of the present disclosure.

FIG. 5 shows a flow diagram of a non-collaborative allocation method according to embodiments of the present disclosure.

DETAILED DESCRIPTION

In some customer service centers, cases may be assigned to agents (e.g., analysts, specialists) for servicing. For example, insurance claims may be assigned to insurance adjusters or other agents for subrogation or other processing; patients or other insureds may be assigned to nurses, pharmacists, or other clinical support specialists; debt collectors may be assigned to debtor cases; and so on. These cases may be assigned in a variety of ways. In some customer service centers (including, for example, workflow, case management, or transaction processing service or support organizations), cases may be assigned to agents based on time of arrival. This strategy may be referred to as a “first-in, first-out”, “FIFO”, or “round-robin” strategy. In some customer service centers, management (e.g., managers or supervisors) may assign cases to agents (including other types of specialists such as those mentioned above), possibly with a particular rationale based on information known to the management, such as information about an agent's skills or historical performance. For some cases, management may have low confidence in their assignments or lack relevant information to make optimal assignments.

Also, in some customer contact centers, cases or contacts may be assigned to agents for servicing. For example, a “lead list” of contacts may be generated for each agent to contact (e.g., using an outbound dialer). These contacts may be assigned to agents using a FIFO strategy. In other environments, contacts may be assigned to agents using other methods such as management-based assignments.

In some embodiments, management assignments may be collaboratively enhanced using an automated case assignment system, such as a behavioral pairing module as described in U.S. patent Ser. No. 14/871,658, filed Sep. 30, 2015, now U.S. Pat. No. 9,300,802, issued Mar. 29, 2016, and incorporated by reference herein. In this way, a collaborative allocation system may leverage a big data, artificial intelligence pairing solution (e.g., the behavioral pairing module) with management expertise (e.g., a management assignment module) to optimize case assignment, resulting in increased performance in a customer service center. For example, collaborative allocation or other uses of behavioral pairing of cases may result in increased subrogation recoveries for insurance claims, improved care for medical patients, improved debt collection, and so on. In other embodiments, behavioral pairing and management-based pairing may be performed separately in a non-collaborative fashion.

In some embodiments, behavioral pairing may be performed “offline” (e.g., not in real time) to assign cases, generate lead lists, or perform other types of contact assignments using collaborative or non-collaborative techniques.

Additionally, the improved performance of collaboratively-allocated cases or non-collaboratively allocated cases as compared to management-allocated cases may be precisely measurable as a gain (e.g., 1%, 3%, 5%, etc.). In some embodiments, gain may be precisely measured using a benchmarking module as described in U.S. patent application Ser. No. 15/131,915, filed Apr. 18, 2016.

FIG. 1 depicts the workflow of a collaborative allocation system 100 according to some embodiments of the present disclosure.

Cases for assignment 110 may be received by, e.g., a management assignment module 120 at a customer service center. The management assignment module 120 may be provided solely by the customer service center (including other types of customer service centers and aforementioned support organizations), or it may be provided in whole or in part as a component of a collaborative allocation system.

The management assignment module 120 may output initial assignment data 130. Initial assignment data 130 may include pairings of cases with agents (including other types of agents and aforementioned specialists), and it may include management rationale for these pairings. For example, each pairing may have an associated score representing management's confidence (e.g., certainty) in a particular pairing. In some embodiments, each pairing may have one or more associated reason codes or other codes indicating management's reasons for a particular pairing (e.g., a good fit with agent's skills or personality given information about the agent known to management). Pairings may include an expected level of time or effort (e.g., intensity) required to resolve the case. Pairings may also take into account balancing caseload across agents including agents' capacities to take on additional cases with varying requirements for time or effort.

The initial assignment data 130 may be analyzed by a behavioral pairing module 140 (or similar pairing engine). At this point, some cases will be excluded (i.e., reserved or frozen) by management. For example, if management has expressed high confidence or a particular reason code for a case, or if the behavioral pairing module 140 has determined low ability improve the initial assignment, the behavioral pairing module 140 will not consider this case for reassignment.

The remaining cases may be split into cases that may be reassigned (e.g., an optimized or “on” group) and cases that may not be reassigned (e.g., a control or “off” group). This split may be done according to any of many possible splitting strategies. For example, management may provide a seed to a pseudorandom number generator, which may be used to randomly distributed cases into one group or the other. In some embodiments, cases will be divided evenly between the groups. In other embodiments, an uneven distribution of cases may be used. For example, 80% of the cases available for reassignment may be split into the optimized group, while 20% of the cases available for reassignment may be split into the control group. The technique used for splitting cases between the groups may be designed to ensure transparency and fairness when benchmarking performance.

Following the splitting of the cases, the cases in the optimized group may be reassigned by the behavioral pairing module 140 or similar automatic pairing techniques. In some embodiments, the behavioral pairing module 140 may incorporate data about the agents and the management (e.g., agent survey data 150A, management survey data 150B, historical data 150C). The survey may include self-assessment questions (e.g., which types of cases are you most skilled at? Which types of cases do you prefer to handle? Which stage of a case are you most skilled at? Which stage of a case do you prefer to handle?). For management, survey questions may be directed at understanding a manager's rationale for assigning particular types of cases or cases at particular stages to particular agents. Historical data may include information such as historical case assignments and outcomes, case “scores” or other case assessments prior to assignment, and other baseline performance measurements. The behavioral pairing module 140 may also search/analyze/process other data sources for information that may be relevant to optimizing assignments and creating artificial intelligence models. The behavioral pairing module 140 may account for any stage of the case management process to optimize case assignments, such as workflow, case management, transaction processing, etc.

The behavioral pairing module 140 may output reassignment data 160, which may include pairings from the optimized group that have been reassigned to different agents. In some embodiments, the reassignment data 160 may be reviewed by the management assignment module 120, and the management assignment module 120 may optionally output revised reassignment data 170. For example, the revised reassignment data 170 may optionally “undo”, revert, or otherwise change some of the reassigned pairings based, for example, on information known to management.

Subsequently, the benchmarking module 180 may measure the gain in performance attributable to the collaboration between management and the behavioral pairing module 140. The benchmarking module 180 may process the outcomes of each pairing to determine the relative performance of cases in the optimized or “on” group, which were collaborative allocated, against the performance of cases in the control or “off” group, which were allocated solely by management. The benchmarking module 180 may output performance measurements 190 (e.g., gain) or other information regarding the performance of the collaborative allocation system 100.

The collaborative allocation system 100 may repeat this process as new cases for assignment (e.g., cases for assignment 110) arrive or otherwise become ready to be allocated among the agents. In some embodiments, the management assignment module 120 or the behavioral pairing module may process results from earlier iterations to improve the management process (e.g., train managers regarding certain rationales that were more or less effective than others) or the behavioral pairing process (e.g., train or update the artificial intelligence algorithms or models).

In some embodiments, the collaborative allocation system 100 may operate “online” (e.g., in real time) as cases arrive at a queue or as management assignments are made. In other embodiments, the collaborative allocation system 100 may operate “offline” (e.g., not in real time), so that a group of cases may be reassigned or otherwise allocated together.

FIG. 2 shows a flowchart of a collaborative allocation method 200 according to embodiments of the present disclosure. At block 210, collaborative allocation method 200 may begin.

At block 210, preparatory information for collaborative allocation may be processed. For example, an assignment or pairing module (e.g., behavioral pairing module 140) may receive agent survey data, management survey data, historical data, or other information for processing in preparation for reassigning or otherwise allocating cases to agents. Collaborative allocation method 200 may proceed to block 220.

At block 220, initial assignment data (e.g., initial management assignment data) may be received. In some embodiments, rationales for management assignments may also be received. Collaborative allocation method 200 may proceed to block 230.

At block 230, a portion of cases may be split out for reassignment, while another portion of cases may be excluded (reserved, frozen, or otherwise held back) from potential reassignment. In some embodiments, these cases may also be excluded from benchmarking measurements. Collaborative allocation method 200 may proceed to block 240.

At block 240, the portion of cases split out for reassignment may be reassigned. In some embodiments, reassignment may be performed by a pairing module such as behavioral pairing module 140. In some embodiments, reassignment data may be output or otherwise returned for management review or further assignment. In some embodiments, a portion of the cases split out for reassignment may be designated to a control group and will not be reassigned. Collaborative allocation method 200 may proceed to block 250.

At block 250, revisions to reassignments, if any, may be received. In some embodiments, management may revise, revert, or otherwise change the reassignments that were carried out by the pairing module at block 240. Revised or reverted cases may be included or excluded from benchmarking measurements. Collaborative allocation method 200 may proceed to block 260.

At block 260, the relative performance of collaboratively-assigned cases and management-assigned cases may be benchmarked or otherwise measured. In some embodiments, results from the comparison may be used to improve the pairing module (e.g., artificial intelligence models of behavioral pairing module 140) or the rationales of management for subsequent management assignments, or both.

Following block 260, collaborative allocation method 200 may end. In some embodiments, collaborative allocation method 200 may return to block 210 to begin allocating additional cases.

FIG. 3 depicts a schematic representation of case splits according to embodiments of the present disclosure. As shown in FIG. 3, seven agents may be assigned up to nine cases. Some cases may be designated as “Ongoing” (e.g., cases that were previously assigned but not yet complete). “Excluded” (i.e., frozen or held back) cases are cases assigned to an agent that were determined to not be made available for reassignment. “Management” cases are cases assigned to an agent that were made available for reassignment but were allocated to the control group. “Joint” cases are cases allocated to the optimized group, which were jointly/collaboratively reassigned and/or revised by management.

In the example of FIG. 3, seven agents (labeled 1 to 7 in the “Agent” column) have a docket or queue of nine cases (labeled “Case 1” to “Case 9” in the header row). Agent 1's first case (“Case 1”) is identified by an “0” for Ongoing, and cases 2-9 have been split for assignment or collaborative allocation: Cases 3 and 8 (“E”) have been excluded from collaborative allocation, and may optionally be excluded from any benchmarking or relative performance analysis. Cases 4, 5, and 7 (“M”) have been assigned by management, and may be benchmarked as being part of the control or off cycle. Cases 2, 6, and 9 (“J”) have been allocated by an automated pairing strategy such as behavioral pairing, and may be benchmarked as being part of the optimized or on cycle. In the case of collaborative allocation, the optimized pairings may be made jointly with management. In other embodiments, such as non-collaborative allocation, the optimized pairings may be made independently by the pairing strategy such as behavioral pairing, without revision or reassignment by management. The remaining agents Agent 2 to Agent 7 have been assigned or reassigned up to nine available cases in a similar manner. As agents close cases in their dockets or queues, and as more cases become available for assignment, these new cases may be split for assignment or reassignment among the available agents according to the collaborative or non-collaborative allocation techniques in use for this set of agents.

The outcome of each case may be associated with whether a case was ongoing, excluded, management-assigned, or jointly-assigned using a pairing strategy such as behavioral pairing. The relative performance of different assignment methodologies may be benchmarked or otherwise measured. For example, the performance gain attributable to jointly-assigned cases using behavioral pairing over management-assigned cases may be benchmarked.

FIG. 4 depicts the workflow of a non-collaborative allocation system 400 according to some embodiments of the present disclosure.

Cases for assignment 110 may be received at a contact center. The cases may be split into two or more groups for assignment by different strategies. In some embodiments, a portion of cases may be assigned randomly, on a FIFO basis, by management, or other case allocation techniques. A second portion of cases may be assigned using a pairing strategy such as behavioral pairing. In some embodiments, as in the example of FIG. 4, a first portion of cases may be received by management assignment module 120, and a second portion of cases may be received by behavioral pairing module 140.

The management assignment module 120 may output management assignment data 410. Management assignment data 410 may include pairings of cases with agents, and it may include management rationale for these pairings. For example, each pairing may have an associated score representing management's confidence (e.g., certainty) in a particular pairing. In some embodiments, each pairing may have one or more associated reason codes or other codes indicating management's reasons for a particular pairing (e.g., a good fit with agent's skills or personality given information about the agent known to management). Pairings may include an expected level of time or effort (e.g., intensity) required to resolve the case. Pairings may also take into account balancing caseload across agents including agents' capacities to take on additional cases with varying requirements for time or effort.

The behavioral pairing module 140 may output behavioral pairing assignment data 420. In some embodiments, the behavioral pairing module 140 may incorporate data about the agents and the management (e.g., agent survey data 150A, management survey data 150B, historical data 150C). The survey may include self-assessment questions (e.g., which types of cases are you most skilled at? Which types of cases do you prefer to handle? Which stage of a case are you most skilled at? Which stage of a case do you prefer to handle?). For management, survey questions may be directed at understanding a manager's rationale for assigning particular types of cases or cases at particular stages to particular agents. Historical data may include information such as historical case assignments and outcomes, case “scores” or other case assessments prior to assignment, and other baseline performance measurements. The behavioral pairing module 140 may also search/analyze/process other data sources for information that may be relevant to optimizing assignments and creating artificial intelligence models.

Subsequently, the benchmarking module 180 may measure the gain in performance attributable to the behavioral pairing module 140 as compared to the management assignment module (or other assignment process such as a random or FIFO process). The benchmarking module 180 may process the outcomes of each pairing to determine the relative performance of cases in the optimized group, which were allocated solely using behavioral pairing, against the performance of cases in the control group, which were allocated solely by management. The benchmarking module 180 may output performance measurements 190 or other information regarding the performance of the non-collaborative allocation system 400.

The non-collaborative allocation system 400 may repeat this process as new cases for assignment (e.g., cases for assignment 110) arrive or otherwise become ready to be allocated among the agents. In some embodiments, the management assignment module 120 or the behavioral pairing module 140 may process results from earlier iterations to improve the management process (e.g., train managers regarding certain rationales that were more or less effective than others) or the behavioral pairing process (e.g., train or update the artificial intelligence algorithms or models).

In some embodiments, the non-collaborative allocation system 400 may operate “online” (e.g., in real time) as cases arrive at a queue or as management assignments are made. In other embodiments, the non-collaborative allocation system 400 may operate “offline” (e.g., not in real time), so that a group of cases may be reassigned or otherwise allocated together.

FIG. 5 shows a flow diagram of a non-collaborative allocation method according to embodiments of the present disclosure. At block 510, non-collaborative allocation method 500 may begin.

At block 510, preparatory information for non-collaborative allocation may be processed. For example, an assignment or pairing module (e.g., behavioral pairing module 140) may receive agent survey data, management survey data, historical data, or other information for processing in preparation for assigning or otherwise allocating cases to agents. Non-collaborative allocation method 500 may proceed to block 520.

At block 520, cases may be split into first and second portions of one or more cases. Non-collaborative allocation method 500 may proceed to block 530.

At block 530, assignment data may be received for the portion of cases split out for management assignment (or, e.g., random or FIFO assignment). Non-collaborative allocation method 500 may proceed to block 540.

At block 540, the second portion of cases may be assigned using a pairing strategy such as behavioral pairing (BP). Non-collaborative allocation method 500 may proceed to block 550.

At block 550, the relative performance of BP-assigned cases and management-assigned cases may be benchmarked or otherwise measured. In some embodiments, results from the comparison may be used to improve the pairing module (e.g., artificial intelligence models of behavioral pairing module 140) or the rationales of management for subsequent management assignments, or both.

Following block 550, non-collaborative allocation method 500 may end. In some embodiments, non-collaborative allocation method 500 may return to block 510 to begin allocating additional cases.

At this point it should be noted that collaborative and non-collaborative allocation using behavioral pairing in accordance with the present disclosure as described above may involve the processing of input data and the generation of output data to some extent. This input data processing and output data generation may be implemented in hardware or software. For example, specific electronic components may be employed in a collaborative and non-collaborative allocation module, behavioral pairing module, benchmarking module, and/or similar or related circuitry for implementing the functions associated with collaborative and non-collaborative allocation using behavioral pairing, such as in a workflow management system, contact center system, case management system, etc. in accordance with the present disclosure as described above. Alternatively, one or more processors operating in accordance with instructions may implement the functions associated with collaborative and non-collaborative allocation using behavioral pairing in accordance with the present disclosure as described above. If such is the case, it is within the scope of the present disclosure that such instructions may be stored on one or more non-transitory computer processor readable storage media (e.g., a magnetic disk or other storage medium), or transmitted to one or more computer processors via one or more signals embodied in one or more carrier waves.

The present disclosure is not to be limited in scope by the specific embodiments described herein. Indeed, other various embodiments of and modifications to the present disclosure, in addition to those described herein, will be apparent to those of ordinary skill in the art from the foregoing description and accompanying drawings. Thus, such other embodiments and modifications are intended to fall within the scope of the present disclosure. Further, although the present disclosure has been described herein in the context of at least one particular implementation in at least one particular environment for at least one particular purpose, those of ordinary skill in the art will recognize that its usefulness is not limited thereto and that the present disclosure may be beneficially implemented in any number of environments for any number of purposes. Accordingly, the claims set forth below should be construed in view of the full breadth and spirit of the present disclosure as described herein. 

The invention claimed is:
 1. A method for allocating cases to agents in a service center system comprising: receiving, by at least one computer processor communicatively coupled to and configured to operate in the service center system, a first plurality of cases for assignment to a first plurality of agents; determining, by the at least one computer processor, initial pairing data for the first plurality of cases to the first plurality of agents; partitioning, by the at least one computer processor, the first plurality of cases based on the initial pairing data, wherein the partitioning provides a plurality of excluded cases, a plurality of management cases, and a plurality of automated cases; assigning, by the at least one computer processor, the plurality of management cases to a second plurality of agents based on a first pairing strategy; assigning, by the at least one computer processor, the plurality of automated cases to a third plurality of agents based on a second pairing strategy; and assigning, by the at least one computer processor, the plurality of excluded cases to a fourth plurality of agents based on the initial pairing data.
 2. The method of claim 1, wherein the partitioning further provides a plurality of joint cases.
 3. The method of claim 2, further comprising: assigning, by the at least one computer processor, the plurality of joint cases to a fifth plurality of agents based on the first pairing strategy and the second pairing strategy.
 4. The method of claim 3, further comprising: determining, by the at least one computer processor, outcome data for each of the first plurality of cases; and after determining the outcome data, determining, by the at least one computer processor, a performance difference between at least one of: the outcome data of the plurality of automated cases and the outcome data of the plurality of management cases; the outcome data of the plurality of automated cases and the outcome data of the plurality of excluded cases; the outcome data of the plurality of automated cases and the outcome data of the first plurality of cases; and the outcome data of the plurality of automated cases and the outcome data of the plurality of joint cases.
 5. The method of claim 1, wherein at least one of the determining initial pairing data and the partitioning is based on at least one of agent survey data, management survey data, and historical case assignment data.
 6. The method of claim 1, wherein the partitioning is based on a predetermined distribution of cases between the plurality of management cases and the plurality of automated cases.
 7. The method of claim 1, wherein at least one agent is in more than one of the first plurality of agents, the second plurality of agents, the third plurality of agents, and the fourth plurality of agents.
 8. A system for allocating cases to agents in a service center system comprising: at least one computer processor communicatively coupled to and configured to operate in the service center system, wherein the at least one computer processor is further configured to: receive a first plurality of cases for assignment to a first plurality of agents; determine initial pairing data for the first plurality of cases to the first plurality of agents; partition the first plurality of cases based on the initial pairing data, wherein the partitioning provides a plurality of excluded cases, a plurality of management cases, and a plurality of automated cases; assign the plurality of management cases to a second plurality of agents based on a first pairing strategy; assign the plurality of automated cases to a third plurality of agents based on a second pairing strategy; and assign the plurality of excluded cases to a fourth plurality of agents based on the initial pairing data.
 9. The system of claim 8, wherein the partitioning further provides a plurality of joint cases.
 10. The system of claim 9, wherein the at least one computer processor is further configured to: assign the plurality of joint cases to a fifth plurality of agents based on the first pairing strategy and the second pairing strategy.
 11. The system of claim 10, wherein the at least one computer processor is further configured to: determine outcome data for each of the first plurality of cases; and after determining the outcome data, determine a performance difference between at least one of: the outcome data of the plurality of automated cases and the outcome data of the plurality of management cases; the outcome data of the plurality of automated cases and the outcome data of the plurality of excluded cases; the outcome data of the plurality of automated cases and the outcome data of the first plurality of cases; and the outcome data of the plurality of automated cases and the outcome data of the plurality of joint cases.
 12. The system of claim 8, wherein at least one of the determining initial pairing data and the partitioning is based on at least one of agent survey data, management survey data, and historical case assignment data.
 13. The system of claim 8, wherein the partitioning is based on a predetermined distribution of cases between the plurality of management cases and the plurality of automated cases.
 14. The system of claim 8, wherein at least one agent is in more than one of the first plurality of agents, the second plurality of agents, the third plurality of agents, and the fourth plurality of agents.
 15. An article of manufacture for allocating cases to agents in a service center system comprising: a non-transitory computer processor readable medium; and instructions stored on the medium; wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to operate in the service center system and thereby cause the at least one computer processor to operate so as to: receive a first plurality of cases for assignment to a first plurality of agents; determine initial pairing data for the first plurality of cases to the first plurality of agents; partition the first plurality of cases based on the initial pairing data, wherein the partitioning provides a plurality of excluded cases, a plurality of management cases, and a plurality of automated cases; assign the plurality of management cases to a second plurality of agents based on a first pairing strategy; assign the plurality of automated cases to a third plurality of agents based on a second pairing strategy; and assign the plurality of excluded cases to a fourth plurality of agents based on the initial pairing data.
 16. The article of manufacture of claim 15, wherein the partitioning further provides a plurality of joint cases.
 17. The article of manufacture of claim 16, wherein the at least one computer processor is further caused to operate so as to: assign the plurality of joint cases to a fifth plurality of agents based on the first pairing strategy and the second pairing strategy.
 18. The article of manufacture of claim 17, wherein the at least one computer processor is further caused to operate so as to: determine outcome data for each of the first plurality of cases; and after determining the outcome data, determine a performance difference between at least one of: the outcome data of the plurality of automated cases and the outcome data of the plurality of management cases; the outcome data of the plurality of automated cases and the outcome data of the plurality of excluded cases; the outcome data of the plurality of automated cases and the outcome data of the first plurality of cases; and the outcome data of the plurality of automated cases and the outcome data of the plurality of joint cases.
 19. The article of manufacture of claim 15, wherein at least one of the determining initial pairing data and the partitioning is based on at least one of agent survey data, management survey data, and historical case assignment data.
 20. The article of manufacture of claim 15, wherein the partitioning is based on a predetermined distribution of cases between the plurality of management cases and the plurality of automated cases. 